A Model Checker for Operator Precedence Languages

The problem of extending model checking from finite state machines to procedural programs has fostered much research toward the definition temporal logics for reasoning on context-free structures. most notable such results are Nested Words, as CaRet and NWTL. Recently, Precedence Oriented Temporal Logic (POTL) been introduced specify prove properties coded trough an Operator Language (OPL). POTL is complete w.r.t. FO restriction MSO logic previously defined a fully equivalent OPL. increases NWTL’s expressive power in perfectly parallel way OPLs more powerful that nested words. In this paper we produce checker, named POMC, OPL expressed POTL. To best our knowledge POMC first implemented openly available checker proving tree-structured recursive programs. We also report experimental evaluation performed nontrivial benchmark.